Dynamic Vehicle Routing with Stochastic Requests
نویسندگان
چکیده
This paper considers vehicle routing problems (VRP) where customer locations and service times are random variables that are realized dynamically during plan execution. It proposes a multiple scenario approach (MSA) that continuously generates plans consistent with past decisions and anticipating future requests. The approach, which combines AI and OR techniques in novel ways, is compared with the best available heuristics that model longdistance courier mail services [Larsen et al., 2002]. Experimental results shows that MSA may significantly decrease travel times and is robust wrt reasonably noisy distributions.
منابع مشابه
Anticipation vs. Reoptimization for Dynamic Vehicle Routing with Stochastic Requests
Due to new business models and technological advances, dynamic vehicle routing is gaining increasing interest. Solving dynamic vehicle routing problems is challenging, since it requires optimization in two directions. First, as a reaction to newly revealed information, current routing plans need to be reoptimized. Second, uncertain future changes of information need to be anticipated by explici...
متن کاملOffline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests
Although increasing amounts of transaction data make it possible to characterize uncertainties surrounding customer service requests, few methods integrate predictive tools with prescriptive optimization procedures to meet growing demand for small-volume urban transport services. We incorporate temporal and spatial anticipation of service requests into approximate dynamic programming (ADP) proc...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملSINTEF REPORT TITLE Dynamic and Stochastic Aspects in Vehicle Routing - A Literature
Vehicle routing is a complex optimization problem with numerous variants related to various forms of transport planning. Particularly in an operational planning situation, the dynamic and stochastic aspects of the problems are important. The research project Dynamic Optimization in Transportation (DOiT) addresses vehicle routing in such a dynamic setting. In this survey, we give an overview of ...
متن کاملA Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW
We consider a dynamic vehicle routing problem with time windows and stochastic customers (DS-VRPTW), such that customers may request for services as vehicles have already started their tours. To solve this problem, the goal is to provide a decision rule for choosing, at each time step, the next action to perform in light of known requests and probabilistic knowledge on requests likelihood. We i...
متن کاملA Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW - Extended version
We consider a dynamic vehicle routing problem with time windows and stochastic customers (DS-VRPTW), such that customers may request for services as vehicles have already started their tours. To solve this problem, the goal is to provide a decision rule for choosing, at each time step, the next action to perform in light of known requests and probabilistic knowledge on requests likelihood. We i...
متن کامل